Tessellation of a Unit Sphere Starting with an Inscribed Convex Triangular Mesh
نویسنده
چکیده
3 Subdivision Algorithm 3 3.1 Centroid of Polyhedron . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Intersection of Ray with Sphere . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.3 Memory Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.4 Pseudocode for a Single Subdivision . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
منابع مشابه
Regular Honeycombs in Elliptic Space
WHEN the elliptic plane is derived from a sphere by identifying antipodal points, the five convex regular solids inscribed in the sphere yield five regular tessellations of the elliptic plane: arrangements of equal regular polygons fitting together to fill the plane without interstices. The actual cases are exhibited in Table I, where the last column indicates that, since the tetrahedron lacks ...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملInscribed and Circumscribed Polyhedra for a Convex Body and Continuous Functions on a Sphere in Euclidean Space
Two related problems concerning continuous functions on a sphere Sn−1 ⊂ Rn are studied, together with the problem of finding a family of polyhedra in Rn one of which is inscribed in (respectively, circumscribed about) a given smooth convex body in Rn. In particular, it is proved that, in every convex body K ⊂ R3, one can inscribe an eight-vertex polyhedron obtained by “equiaugmentation” of a si...
متن کاملInscribed Approximation based Adaptive Tessellation of Catmull-Clark Subdivision Surfaces
Catmull-Clark subdivision scheme provides a powerful method for building smooth and complex surfaces. But the number of faces in the uniformly refined meshes increases exponentially with respect to subdivision depth. Adaptive tessellation reduces the number of faces needed to yield a smooth approximation to the limit surface and, consequently, makes the rendering process more efficient. In this...
متن کاملOn 3D Shape Similarity
We study the 3D shape similarity between closed surfaces. We represent a curved or polyhedral 3D object of genus zero using a mesh representation that has nearly uniform distribution with known connectivity among mesh nodes. We define a shape similarity metric based on the L2 distance between the local curvature distributions over the mesh representations of the two objects. For both convex and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015